Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
نویسندگان
چکیده
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. Shu Lin, T. Kasami, T. Fujiwara, M. Fossorier Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
منابع مشابه
Tail-biting Trellises for Linear Codes and their Duals
Trellis representations of linear block codes are attractive because of their use in soft decision decoding algorithms. An interesting property that is known for conventional trellises is that the minimal conventional trellis (known to be unique) for a linear block code, and its dual have the same state-complexity profile. This interesting property follows from the BCJR construction [1] of the ...
متن کاملMAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo (or iterative) decoding which achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applicat...
متن کاملOn the Intractability of Permuting a Block Code to Minimize Trellis Complexity [Correspondence] - Information Theory, IEEE Transactions on
A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product...
متن کاملTail-Biting Trellises of Block Codes: Trellis Complexity and Viterbi Decoding Complexity
Tail-biting trellises of linear and nonlinear block codes are addressed. We refine the information-theoretic approach of a previous work on conventional trellis representation, and show that the same ideas carry over to tail-biting trellises. We present lower bounds on the state and branch complexity profiles of these representations. These bounds are expressed in terms of mutual information be...
متن کاملTrellis Representations for Linear Block Codes
Trellis Representations for Linear Block Codes Heide Gluesing-Luerssen University of Kentucky Department of Mathematics 715 Patterson Office Tower Lexington, KY 40506 USA During the last decade conventional and tail-biting trellis representations of linear block codes have gained a great deal of attention. A tail-biting trellis for a block code of length n is an edge-labeled layered graph on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017